Multiple sink location problems in dynamic path networks
نویسندگان
چکیده
منابع مشابه
Multiple Sink Location Problems in Dynamic Path Networks
This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of k sinks in a given path so that each evacuee is sent to...
متن کاملMinimax Regret k-sink Location Problem in Dynamic Path Networks
This paper considers minimax regret 1-sink location problems in dynamic path networks. A dynamic path network consists of an undirected path with positive edge lengths and constant edge capacity and the vertex supply which is nonnegative value, called weight, is unknown but only the interval of weight is known. A particular assignment of weight to each vertex is called a scenario. Under any sce...
متن کاملCentroid Dynamic Sink Location for Clustered Wireless Mobile Sensor Networks
The wireless sensor network consists of three main components: a large number of small-sized sensors, a remote sink connected to the internet, and a cluster head whose existence depends on the overall network structure. The sensor in the wireless sensor network can be deployed through many ways, such as a simple model, a random walk model, and a random direction model. There were studies that e...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
Improved Algorithms for Computing k-Sink on Dynamic Path Networks
We present a novel approach to finding the k-sink on dynamic path networks with general edge capacities. Our first algorithm runs in O(n logn + k2 log4 n) time, where n is the number of vertices on the given path, and our second algorithm runs in O(n log3 n) time. Together, they improve upon the previously most efficient O(kn log2 n) time algorithm due to Arumugam et al. [1] for all values of k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.05.053